Packing Steiner trees: a cutting plane algorithm and computational results
نویسندگان
چکیده
In this paper we describe a cutting plane algorithm for the Steiner tree packing problem. We use our algorithm to solve some switchbox routing problems of VLSI-design and report on our computational experience. This includes a brief discussion of separation algorithms, a new LP-based primal heuristic and implementation details. The paper is based on the polyhedral theory for the Steiner tree packing polyhedron developed in our companion paper GMW92] and meant to turn this theory into an algoritmic tool for the solution of practical problems.
منابع مشابه
Packing Steiner Trees: Further Facets
In this paper we continue the investigations in GMW92a] for the Stei-ner tree packing polyhedron. We present several new classes of valid inequalities and give suucient (and necessary) conditions for these inequalities to be facet-deening. It is intended to incorporate these inequalities into an existing cutting plane algorithm that is applicable to practical problems arising in the design of e...
متن کاملThe Steiner tree packing problem in VLSI design
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switch-box routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we deve...
متن کاملThe Steiner tree packing problem
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we devel...
متن کاملOptimal Packing of Group Multi-Casting
This paper presents algorithms, heuristics and lower bounds addressing optimization issues in many-to-many multicasting. Two main problems are addressed: (1) a precise combinatorial comparison of optimal multicast trees with optimal multicast rings, (2) an optimized sharing of network resources (i.e., nodes and links) among multiple multicast groups that coexist. The former is central to the ch...
متن کاملThe cavity approach for Steiner trees Packing problems
The Belief Propagation approximation, or cavity method, has been recently applied to several combinatorial optimization problems in its zero-temperature implementation, the Max-Sum algorithm. In particular, recent developments to solve the Edge-Disjoint paths problem and the Prize collecting Steiner tree Problem on graphs have shown remarkable results for several classes of graphs and for bench...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 72 شماره
صفحات -
تاریخ انتشار 1996